Approximation algorithms for the traveling salesman problem
نویسندگان
چکیده
منابع مشابه
Approximation algorithms for the traveling salesman problem
We first prove that the minimum and maximum traveling salesman problems, their metric versions as well as some versions defined on parameterized triangle inequalities (called sharpened and relaxed metric traveling salesman) are all equi-approximable under an approximation measure, called differential-approximation ratio, that measures how the value of an approximate solution is placed in the in...
متن کاملApproximation Algorithms for the Metric Asymmetric Traveling Salesman Problem
The traveling salesman problem (TSP) is a well-known, commonly studied, and very important NP-hard optimization problem in theoretical computer science. It consists of finding a cyclic (i.e., start and stop on the same vertex) tour of minimum cost of a graph G that visits each vertex exactly once; i.e., a Hamiltonian cycle. The undirected or directed graph G has non-negative weights associated ...
متن کاملMassively Parallel Approximation Algorithms for the Traveling Salesman Problem
The traveling salesman problem (TSP) describes a salesman who needs to travel through a list of given cities exactly once by taking the shortest possible tour. The problem is NP-Complete since there are no known polynomial time algorithms to solve it. The main motivation to solve this problem is that the applications of Traveling Salesman are immense. It can be used by banks to find an optimal ...
متن کاملApproximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem
We present the first nontrivial approximation algorithm for the bottleneck asymmetric traveling salesman problem. Given an asymmetric metric cost between n vertices, the problem is to find a Hamiltonian cycle that minimizes its bottleneck (or maximum-length edge) cost. We achieve an O(log n/ log log n) approximation performance guarantee by giving a novel algorithmic technique to shortcut Euler...
متن کاملApproximation Algorithms for the Black and White Traveling Salesman Problem
The black and white traveling salesman problem (BWTSP) is to find the minimum cost hamiltonian tour of an undirected complete graph G, containing black and white vertices, subject to two restrictions: the number of white vertices, and the cost of the subtour between two consecutive black vertices are bounded. This paper focuses on designing approximation algorithms for the BWTSP in a graph sati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Methods of Operations Research (ZOR)
سال: 2003
ISSN: 1432-2994,1432-5217
DOI: 10.1007/s001860200239